Ics 691: Advanced Data Structures Lecture 2 2 Searching a List 2.1 Static Structure
نویسندگان
چکیده
In the last lecture we discussed amortized analysis and looked at the 3 methods: aggregate, accounting, and potential. We used these 3 methods to show that the amortized complexity of the binary counter problem is O(n). Finally, we applied amortized analysis to the problem of inserting data into dynamic arrays, showing that inserting n objects has an amortized cost of O(n), despite the worst-case result of O(n2).
منابع مشابه
Ics 691: Advanced Data Structures Lecture 1 2.1 Aggregate Method
Amortized analysis is a method of analyzing algorithms that can help us determine an upper bound on the complexity of an algorithm. This is particular useful when analyzing operations on data structures, when they they involve slow, rarely occurring operations and fast, more common operations. With this disparity between each operations’ complexity, it is difficult to get a tight bound on the o...
متن کاملAdvanced Data Structures 2 Introduction 2.1 Dynamic Trees Problem 3 Sleator and Tarjan's St Trees [1] [2]
The problem of maintaining a forest where edge insertions and deletions are allowed is called the dynamic trees problem. Efficient solution to this problem have numerous applications, particularly in dynamic graphs. Several data structures which supports dynamic trees problem in logarithmic time have been proposed. In these lecture we will see two such data structures, the first is ST-tress pro...
متن کاملLecture Notes: Range Searching with Linear Space
In this lecture, we will continue our discussion on the range searching problem. Recall that the input set P consists of N points in R. Given an axis-parallel rectangle q, a range query reports all the points of P ∩ q. We want to maintain a fully dynamic structure on P to answer range queries efficiently. We will focus on non-replicating structures [2, 3]. Specifically, consider that each point...
متن کاملLecture Notes on Data Structures and Invariants
What this course studies so far is a pretty comprehensive account of the reasoning principles for algorithms implemented in imperative programs.1 But the point of today’s lecture is that there is more to understanding programs than just understanding their algorithms. Algorithms and data structures courses have two major components: first the algorithms and then the data structures. Indeed, a l...
متن کامل2 Finishing the Description of Fusion Trees 2.1 Motivation 2.2 the Problem -fixed-universe Successor 2.3 Overview of Fusion Trees
More generally, the goal of fusion trees is to support the operations insert(x), delete(x), successor(x) and predecessor(x) in o(lgn) time on a transdichotomous RAM. The transdichotomous RAM model of computation was intrdouced in Lecture 2 (Feb. 12, 2003). The data-structure problem defined by these four operations is called the fixed-universe successor problem which was introduced in Lecture 1...
متن کامل